Dynamic Graph Clustering Using Minimum-Cut Trees
نویسندگان
چکیده
منابع مشابه
Dynamic Graph Clustering Using Minimum-Cut Trees
Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. Based on properties of minimum-cut trees, a clustering algorithm by Flake et al. does however yield such a provable guarantee, which ensures the quality of bottlenecks within the clustering. We show that the structure of minimum s-t-cuts in a graph allows for an efficient dynamic u...
متن کاملGraph Clustering and Minimum Cut Trees
In this paper, we introduce simple graph clustering methods based on minimum cuts within the graph. The clustering methods are general enough to apply to any kind of graph but are well suited for graphs where the link structure implies a notion of reference, similarity, or endorsement, such as web and citation graphs. We show that the quality of the produced clusters is bounded by strong minimu...
متن کاملFully-Dynamic Hierarchical Graph Clustering Using Cut Trees
Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. However, a hierarchical clustering algorithm by Flake et al., which is based on minimum s-t-cuts whose sink sides are of minimum size, yields such a provable guarantee. We introduce a new degree of freedom to this method by allowing arbitrary minimum s-t-cuts and show that this unr...
متن کاملFast Incremental Minimum-Cut Based Algorithm for Graph Clustering
In this paper we introduce an incremental clustering algorithm for undirected graphs. The algorithm can maintain clusters efficiently in presence of insertion and deletion (updation) of edges and vertices. The algorithm produces clusters that satisfies the quality requirement, given by the bicriteria of [6]. To the best of our knowledge, this is the first clustering algorithm, for dynamic graph...
متن کاملInformation Theoretic Clustering Using Minimum Spanning Trees
In this work we propose a new information-theoretic clustering algorithm that infers cluster memberships by direct optimization of a non-parametric mutual information estimate between data distribution and cluster assignment. Although the optimization objective has a solid theoretical foundation it is hard to optimize. We propose an approximate optimization formulation that leads to an efficien...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2012
ISSN: 1526-1719
DOI: 10.7155/jgaa.00269